An interaction language for argumentation-based negotiation

Language is the medium used by heterogeneous and autonomous members of a community to communicate and to exchange knowledge. Social work allows members in a community to resolve problems that they could not face individually, but they must be able to interact in order to do it. Furthermore, is necessary to have a negotiation mechanism that allows members of a system to interact through it, trying to reach an agreement in order to satisfy their goals. Our work is oriented towards the design of an interaction language that allows argumentation-based negotiation among collaborative BDI agents.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

Interaction among BDI argumentative agents: a dialogue games approach

Negotiation is a fundamental activity in a multi-agent system. The members of the system negotiate in order to coordinate their activities and to distribute resources and tasks trying to reach a state acceptable to all. Carrying out a negotiation process requires that agents be able to interact. In this work, protocol interaction is implemented by means of dialogues between agents, and the set of dialogues generated inside the same negotiation process conforms a conversation. We propose an interaction language that allows argumentation-based negotiation among collaborative BDI agents. For the language description we use a formalism, called Dialogue Games, which allows to specify the nature of the utterancesVI Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Specifying agent interaction protocols

Argumentation-based negotiation is an adequate alternative for modelling situations in which agents have limited information and bounded capacities. In this research line, each agent elaborates arguments as part of its own planning process and also to justify its proposals, counter-proposals and rejections during the negotiation process. Our proposal analyzes and compares three tools for the specification of interaction protocols: finite state machines, UML, and dialogues games.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

Interaction among BDI argumentative agents: a dialogue games approach

Negotiation is a fundamental activity in a multi-agent system. The members of the system negotiate in order to coordinate their activities and to distribute resources and tasks trying to reach a state acceptable to all. Carrying out a negotiation process requires that agents be able to interact. In this work, protocol interaction is implemented by means of dialogues between agents, and the set of dialogues generated inside the same negotiation process conforms a conversation. We propose an interaction language that allows argumentation-based negotiation among collaborative BDI agents. For the language description we use a formalism, called Dialogue Games, which allows to specify the nature of the utterancesVI Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

A Framework for Deliberation and Negotiation among BDI Agents

This work presents an interaction model among collaborative agents based on dialogues. For the specification we use a formalism, called Dialogue Games, which allows to describe the nature of the utterances available in each dialogue. We propose an interaction language which favors deliberation and argumentationbased negotiation among BDI agents. For each locution's specification we establish a set of preconditions, its meaning, the expected responses, and the modifications that it could produce. The interaction protocol and the interaction language as a whole can be used for specifying meaningful interaction between dialogical partners by following the rules of an individual dialogue.Facultad de Informátic

An interaction language for argumentation-based negotiation

Language is the medium used by heterogeneous and autonomous members of a community to communicate and to exchange knowledge. Social work allows members in a community to resolve problems that they could not face individually, but they must be able to interact in order to do it. Furthermore, is necessary to have a negotiation mechanism that allows members of a system to interact through it, trying to reach an agreement in order to satisfy their goals. Our work is oriented towards the design of an interaction language that allows argumentation-based negotiation among collaborative BDI agents.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

An epistemic approach to model uncertainty in data-graphs

Graph databases are becoming widely successful as data models that allow to effectively represent and process complex relationships among various types of data. As with any other type of data repository, graph databases may suffer from errors and discrepancies with respect to the real-world data they intend to represent. In this work we explore the notion of probabilistic unclean graph databases, previously proposed for relational databases, in order to capture the idea that the observed (unclean) graph database is actually the noisy version of a clean one that correctly models the world but that we know partially. As the factors that may be involved in the observation can be many, e.g, all different types of clerical errors or unintended transformations of the data, we assume a probabilistic model that describes the distribution over all possible ways in which the clean (uncertain) database could have been polluted. Based on this model we define two computational problems: data cleaning and probabilistic query answering and study for both of them their corresponding complexity when considering that the transformation of the database can be caused by either removing (subset) or adding (superset) nodes and edges.Comment: 25 pages, 3 figure

LA TUTORÍA COMO HERRAMIENTA PARA EL SEGUIMIENTO ACADÉMICO DE LOS ALUMNOS

En los últimos tiempos se han producido múltiples transformaciones en la Educación Superior, una de ellas lo constituyen el esfuerzo para la inclusión y la democratización del acceso a la misma, la permanencia y el término. Uno de los desafíos es la retención de los alumnos en los primeros tramos de sus estudios. Las carreras de ingeniería enfrentan hoy esta problemática y es uno de los principales temas en su agenda de trabajo. En la Universidad Tecnológica Nacional - Facultad Regional Resistencia se viene desarrollando desde el año 2006, un Sistema de Acción Tutorial cuyo objetivo apunta a consolidarse como una estrategia educativa de apoyo a los alumnos y como una acción orientada a diagnosticar y asesorar en aquellas problemáticas relacionadas al desempeño académico. Desde sus inicios hasta hoy el sistema se ha desarrollado y avanzado en etapas. Una de las instancias que influye positivamente fue la implementación del Proyecto de Apoyo para el mejoramiento de la enseñanza en primer año de las carreras de grado de ciencias exactas y naturales, ciencias económicas e informáticas (PACENI). Este programa considera necesario generar estrategias institucionales específicas para promover la motivación continua de los alumnos, apoyándolos en la adquisición de habilidades cognitivas, colaborar en la conformación del autocontrol de su propio proyecto académico y el logro de sus metas personales. En esta oportunidad se presentarán los resultados del trabajo de seguimiento realizado en la carrera de Ingeniería en Sistemas de Información y en la carrera de Ingeniería Química, en la que se ha intervenido desde el seminario nivelador de ingreso. Con la información obtenida se elaboró un diagnóstico situacional de los alumnos permitiendo una clasificación según su desempeño académico; el objetivo es trabajar en la prevención y detección temprana de las dificultades de los alumnos para poder brindarle un apoyo adecuado

On the complexity of finding set repairs for data-graphs

In the deeply interconnected world we live in, pieces of information link domains all around us. As graph databases embrace effectively relationships among data and allow processing and querying these connections efficiently, they are rapidly becoming a popular platform for storage that supports a wide range of domains and applications. As in the relational case, it is expected that data preserves a set of integrity constraints that define the semantic structure of the world it represents. When a database does not satisfy its integrity constraints, a possible approach is to search for a 'similar' database that does satisfy the constraints, also known as a repair. In this work, we study the problem of computing subset and superset repairs for graph databases with data values using a notion of consistency based on a set of Reg-GXPath expressions as integrity constraints. We show that for positive fragments of Reg-GXPath these problems admit a polynomial-time algorithm, while the full expressive power of the language renders them intractable.Comment: 35 pages , including Appendi

Introducing a Context-Aware Scheme in an intelligent reasoning process

Several investigations have been developed around analogies based reasoning in different domains, however the analogy between arguments has not been deeply explored. A semiformal way to express these patterns of reasoning were proposed by Walton, through argument schemes from analogy. From this, it is possible to propose computable approximations for comparing arguments. In this paper we introduce a formalism based on the comparison of arguments through descriptors or labels which describes an aspect that the argument refers to. This formalism allows us classifying similar arguments considering the natural descriptors of them, in a specific context.XVII Workshop Agentes y Sistemas Inteligentes (WASI).Red de Universidades con Carreras en Informática (RedUNCI